A Purely Syntactical Definition of Confirmation

نویسنده

  • Carl G. Hempel
چکیده

1. Objective of the paper. The concept of confirmAtion occupies a centra] position in the methodology of empirical scienc'e. For it is the distinctive characteristic of an empirical hypothesis to be am.enable, at least in principle, to a test based on suitable observations or experiments; the empirical data obtained in a test-or, as we shall prefer to S2:1y, the observation sentences describing those data-may then either confirm or disconfirm the given hypothesis, or they may be neutral with respect to it. To say that certain observation sentences confirm or disconfirm a hypothesis, does not, of course, generally mean that those observation sentences suffice strictly to prove or to refute the hypothesis in question, but rather that they constitute. favorable, or unfavorable, e.vidence for it; a.nd the term "neutral" is to indicate that the observation sentences are either entirely irrelevant to the hypothesis 1 or at least insufficie.nt to strengthen or weaken it. Ao~ precise definition of the concepts of confirmation, disconfirmation, a,nd neutrality ,vhich have just been loosely characterized appears to be indispen.sa,ble for an adequate treatment of several fundamental problems in the logic and nlethodology of emi)irical science; these problems include the elucidation of the logical structure of scientific tests, explanations, and predictions, the logical analysis of the so-called inductive method, and a rigorous statement and development of the operationalist and empiricist conceptions of meaning and knowledge. However, no general definition of the concept of confirlnation and of its correlates seems to have been developed so far; and the few rudimentary definitions in1plicit in recent methodological writings prove unsatisfactory in various respects (cf. section 3, end). It is the objective of this study to develop a general definition" of confirmation in purely logical tern1S. Confirmation ,viII be construed as a certain logical relationship which may be considered as an ideal model or a "rational reconstruction" of the concept of confirmation as it is used in the methodology of empirical acience. Apart from its relevance for the theory of science, the definition off confirmation here to be developed appears to be of interest also from the viewpoint of formal logic ; for it is of a purely syntactical character,3 and it establishes a relation analogous in various ways to the relation of consequence in its syntactical interpretation. In fact, confirmation will prove to be, in a certain

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Les types de données syntaxiques du système F

We give in this paper a purely syntactical definition of input and output types of system F . We define the syntactical data types as input and output types. We show that any type with positive quantifiers is a syntactical data type and that an input type is an output type. We give some restrictions on the ∀-elimination rule in order to prove that an output type is an input type. Mathematics Su...

متن کامل

On the equivalence of Goodman's and Hempel's paradoxes.

Historically, Nelson Goodman's paradox involving the predicates 'grue' and 'bleen' has been taken to furnish a serious blow to Carl Hempel's theory of confirmation in particular and to purely formal theories of confirmation in general. In this paper, I argue that Goodman's paradox is no more serious of a threat to Hempel's theory of confirmation than is Hempel's own paradox of the ravens. I pro...

متن کامل

A syntactical proof of the Marriage Lemma

We give a proof of the classical Marriage Lemma 4] using completeness of hyperresolution. This argument is purely syntactical, and extends directly to the innnite case. As an application we give a purely syntactical version of a proof that resolution is exponential on the pigeonhole principle.

متن کامل

Soundness of a purely syntactical formalizationof weakest preconditions

We present a purely syntactical deenition of E.W. Dijkstra's predicate transformer wp for nondeterministic while-programs in innnitary logic. Then we show that it is sound wrt. a deenition of weakest preconditions given in terms of denotational semantics.

متن کامل

Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic

We present a purely syntactical but nevertheless handy definition of Dijkstra’s predicate transformer wp in weak second-order logic. This formalization allows us to prove a normal form theorem of wp, from which interesting properties can be inferred. In particular, it turns out that wp(P, .) is a homomorphism on the class of formulae in the formalism considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1943